Strong Normalisation of Cut-Elimination that Simulates β-Reduction Long version
نویسندگان
چکیده
This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cut-elimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reductions as well as a simulation in NederpeltKlop’s λI-calculus. It is also shown that the type-free terms enjoy the preservation of strong normalisation (PSN) property with respect to β-reduction in an isomorphic image of the type-free λ-calculus.
منابع مشابه
Strong Normalisation of Cut-Elimination that Simulates β-Reduction
This paper is concerned with strong normalisation of cutelimination for a standard intuitionistic sequent calculus. The cutelimination procedure is based on a rewrite system for proof-terms with cut-permutation rules allowing the simulation of β-reduction. Strong normalisation of the typed terms is inferred from that of the simply-typed λ-calculus, using the notions of safe and minimal reductio...
متن کاملProving Strong Normalisation via Non-deterministic Translations into Klop’s Extended λ-Calculus
In this paper we present strong normalisation proofs using a technique of non-deterministic translations into Klop’s extended λ-calculus. We first illustrate the technique by showing strong normalisation of a typed calculus that corresponds to natural deduction with general elimination rules. Then we study its explicit substitution version, the type-free calculus of which does not satisfy PSN w...
متن کاملThe Prismoid of Resources
We define a framework called the prismoid of resources where each vertex is a λ-calculus with the possibility of having different explicit resources and/or explicit cut elimination based on a different choice to make explicit or implicit (meta-level) the definition of the contraction, weakening, substitution operations. For all the calculi in the prismoid we show simulation of β-reduction, conf...
متن کاملRevisiting the Correspondence between Cut Elimination and Normalisation
Cut-free proofs in Herbelin’s sequent calculus are in 1-1 correspondence with normal natural deduction proofs. For this reason Herbelin’s sequent calculus has been considered a privileged middle-point between L-systems and natural deduction. However, this bijection does not extend to proofs containing cuts and Herbelin observed that his cutelimination procedure is not isomorphic to β-reduction....
متن کاملCut-elimination in the Strict Intersection Type Assignment System Is Strongly Normalising
This paper defines reduction on derivations in the strict intersection type assignment system of [1], by generalising cut-elimination, and shows a strong normalisation result for this reduction. Using this result, new proofs are given for the approximation theorem and the characterisation of normalisability using intersection types.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008